Disjoint Difference Families from Galois Rings
نویسنده
چکیده
In this paper, we give new constructions of disjoint difference families from Galois rings. The constructions are based on choosing cosets of the unit group of a subring in the Galois ring GR(p2, p2s). Two infinite families of disjoint difference families are obtained from the Galois rings GR(p2, p4n) and GR(22, 22s).
منابع مشابه
Divisible difference families from Galois rings GR(4, n) and Hadamard matrices
We give a new construction of difference families generalizing Szekeres’s difference families [17]. As an immediate consequence, we obtain some new examples of difference families with several blocks in multiplicative subgroups of finite fields. We also prove that there exists an infinite family of divisible difference families with two blocks in a unit subgroup of the Galois ring GR(4, n). Fur...
متن کاملDifference families with applications to resolvable designs
Some block disjoint difference families are constructed in rings with the property that there are k distinct units uit 0 < i < k — 1, such that differences ut — Uj (0 < i < j < k — 1) are all units. These constructions are utilized to produce a large number of classes of resolvable block designs.
متن کاملConstructions of Partial Difference Sets and Relative Difference Sets Using Galois Rings
We use Galois rings to construct partial diierence sets and relative diierence sets in non-elementary abelian p-groups. As an example, we also use Galois ring GR(4; 2) to construct a (96,20,4) diierence set in Z 4 Z 4 Z 6 .
متن کاملA Categorical Approach to Picard-vessiot Theory
Picard-Vessiot rings are present in many settings like differential Galois theory, difference Galois theory and Galois theory of Artinian simple module algebras. In this article we set up an abstract framework in which we can prove theorems on existence and uniqueness of Picard-Vessiot rings, as well as on Galois groups corresponding to the Picard-Vessiot rings. As the present approach restrict...
متن کاملUniversal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
In t#liis 1)apcr ncw families o f stmngly universal hash funct,ions, or equivalently, authentication codes, are proposed. Their parameters are derived from bounds on exponential sums over finite fields and Galois rings. This is the first tirnr hash families based upon such exponential sums have 1)een considered. Thi>ir performance improves the previously best known c.oiist,ructions and they rai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017